Asymptotics of input-constrained binary symmetric channel capacity
نویسندگان
چکیده
منابع مشابه
Asymptotics of Input-Constrained Binary Symmetric Channel Capacity
We study the classical problem of noisy constrained capacity in the case of the binary symmetric channel (BSC), namely, the capacity of a BSC whose inputs are sequences chosen from a constrained set. Motivated by a result of Ordentlich and Weissman [In Proceedings of IEEE Information Theory Workshop (2004) 117–122], we derive an asymptotic formula (when the noise parameter is small) for the ent...
متن کاملAsymptotics of Input-Constrained Erasure Channel
In this paper, we examine an input-constrained erasure channel and we characterize the asymptotics of its capacity when the erasure rate is low. More specifically, for a general memoryless erasure channel with its input supported on an irreducible finite-type constraint, we derive partial asymptotics of its capacity, using some series expansion type formulas of its mutual information rate; and ...
متن کاملInput-Constrained Erasure Channel
The input-constrained erasure channel with feedback is considered, where the binary input sequence contains no consecutive ones, i.e., it satisfies the (1,∞)-RLL constraint. We derive the capacity for this setting, which can be expressed as Cǫ = max0≤p≤ 1 2 Hb(p) p+ 1 1−ǫ , where ǫ is the erasure probability and Hb(·) is the binary entropy function. Moreover, we prove that a-priori knowledge of...
متن کاملThermodynamics of the binary symmetric channel
We study a hidden Markov process which is the result of a transmission of the binary symmetric Markov source over the memoryless binary symmetric channel. This process has been studied extensively in Information Theory and is often used as a benchmark case for the so-called denoising algorithms. Exploiting the link between this process and the 1D Random Field Ising Model (RFIM), we are able to ...
متن کاملThe Feedback Capacity of the $(1,\infty)$-RLL Input-Constrained Erasure Channel
The input-constrained erasure channel with feedback is considered, where the binary input sequence contains no consecutive ones, i.e., it satisfies the (1,∞)-RLL constraint. We derive the capacity for this setting, which can be expressed as Cǫ = max0≤p≤ 1 2 Hb(p) p+ 1 1−ǫ , where ǫ is the erasure probability and Hb(·) is the binary entropy function. Moreover, we prove that a-priori knowledge of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Applied Probability
سال: 2009
ISSN: 1050-5164
DOI: 10.1214/08-aap570